Time–space trade-offs for Lempel–Ziv compressed indexing

Time-space trade-offs for Lempel-Ziv compressed indexing

Given a string S, the compressed indexing problem is to preprocess S into a compressed representation that supports fast substring queries. The goal is to use little space relative to the compressed size of S while supporting fast queries. We present a compressed index based on the Lempel–Ziv 1977 compression scheme. We obtain the following time-space trade-offs: For constant-sized alphabets (i...

Trade-offs

23. Stent, G.S. (1972). Prematurity and uniqueness in scientific discovery. Sci. Am. 227, 84–93. 24. Mirsky, A.E., and Pollister, A.W. (1946). Chromosin, a desoyribose nucleoprotein complex of the cell nucleus. J. Gen. Physiol. 30, 117–148. 25. Boivin, A. (1947). Directed mutation in colon bacilli, by an inducing principle of desoxyribonucleic nature: Its meaning for the general biochemistry of...

Trade-Offs for Add Gossiping

In the gossiping problem, each node of a network starts with a unique piece of information and must acquire the information of all the other nodes. This is done using two-way communications between pairs of nodes. In this paper, we consider gossiping in n-node networks with n odd, where we use a linear cost model, in which the cost of communication is proportional to the amount of information t...

Compressed domain indexing of losslessly compressed images

Indexing Compressed Text

As a result of the rapid growth of the volume of electronic data, text compression and indexing techniques are receiving more and more attention. These two issues are usually treated as independent problems, but approaches of combining them have recently attracted the attention of researchers. In this thesis, we review and test some of the more effective and some of the more theoretically inter...